Lance Fortnow

Lance Jeremy Fortnow is a computer scientist in the field of computational complexity and its applications, notable for producing major results on interactive proof systems.

Contents

Biography

Lance Fortnow received a Ph.D. in Applied Mathematics from MIT in 1989,[1] supervised by Michael Sipser. He has been a professor in the Electrical Engineering and Computer Science Department at Northwestern University since 2008.[2] Fortnow is founding editor-in-chief of the journal ACM Transaction on Computation Theory.[3] He is chair of ACM SIGACT[4] and was chair of the IEEE Conference on Computational Complexity[5] from 2000 to 2006. In 2003, Fortnow began one of the first blogs devoted to theoretical computer science[6] and has written for it since then. In September 2009, Fortnow brought mainstream attention to complexity theory when he published an article surveying the progress made in the P versus NP problem in the Communications of the Association of Computing Machinery.[7][8]

Work

In his many publications, Fortnow has contributed important results to the field of computational complexity. While still a grad student at MIT, Fortnow showed that there are no perfect zero-knowledge protocols for NP-complete languages unless the polynomial hierarchy collapses.[9] With Michael Sipser, he also demonstrated that relative to a specific oracle there exists a language in co-NP that does not have an interactive protocol.[10]

In November 1989, Fortnow received an email from Noam Nisan showing that co-NP had multiple prover interactive proofs (MIP). With Carsten Lund and Howard Karloff, he used this result to develop an algebraic technique for the construction of interactive proof systems and prove that every language in the polynomial-time hierarchy has an interactive proof system.[11] Their work was hardly two weeks old when Adi Shamir employed it to prove that IP=PSPACE.[12] Quickly following up on this (January 17, 1990 less than two months after receiving Nisan's email) Fortnow, along with László Babai and Carsten Lund, proved that MIP=NEXP.[13] These algebraic techniques were expanded further by Fortnow, Babai, Leonid Levin, and Mario Szegedy when they presented a new generic mechanism for checking computations.[14]

Since this time Fortnow has continued to publish on a variety of topics in the field of computational complexity including derandomization, sparse languages, and oracle machines. Fortnow has also published on quantum computing, game theory, genome sequencing, and economics.

Lance Fortnow's work in economics includes work in game theory, optimal strategies, and prediction. With Duke Whang, Fortnow has examined the classic game theory problem of the prisoner's dilemma, extending the problem so that the dilemma is posed sequentially an infinite number of times. They investigated what strategies the players should take given the constraints that they draw their strategies from computationally bounded sets and introduce “grace periods” to prevent the dominance of vengeful strategies.[15] Fortnow also examined the logarithmic market scoring rule (LMSR) with market makers. He helped to show that LMSR pricing is #P-hard and propose an appoximation technique for pricing permutation markets.[16] He has also contributed to an examination the behavior of informed traders working with LMSR market makers.[17]

Awards and honors

References

  1. ^ Lance Fortnow at the Mathematics Genealogy Project
  2. ^ Northwestern University Electrical Engineering and Computer Science Department Faculty
  3. ^ ACM Transaction on Computation Theory
  4. ^ ACM SIGACT
  5. ^ IEEE Conference on Computational Complexity
  6. ^ Computational Complexity Weblog
  7. ^ J. Markoff. Prizes Aside, the P-NP Puzzler Has Consequences. The New York Times 7 Oct. 2009.
  8. ^ L. Fortnow. The Status of the P Versus NP Problem. Communications of the ACM 9 (2009).
  9. ^ L. Fortnow. The complexity of perfect zero-knowledge. In S. Micali, editor, Randomness and Computation, volume 5 of Advances in Computing Research, pages 327-343. JAI Press, Greenwich, 1989.
  10. ^ L. Fortnow and M. Sipser. Are there interactive protocols for co-NP languages? Information Processing Letters, 28:249-251, 1988.
  11. ^ C. Lund, L. Fortnow, H. Karloff, and N. Nisan. Algebraic methods for interactive proof systems. Journal of the ACM, 39(4):859-868, 1992.
  12. ^ A. Shamir. IP = PSPACE. Journal of the ACM 39(4):869-877, 1992.
  13. ^ L. Babai, L. Fortnow, and C. Lund. Nondeterministic exponential time has two-prover interactive protocols. Computational Complexity, 1(1):3-40, 1991.
  14. ^ L. Babai, L. Fortnow, L. Levin, and M. Szegedy. Checking computations in polylogarithmic time. In Proceedings of the 23rd ACM Symposium on the Theory of Computing, pages 21-31. ACM, New York, 1991.
  15. ^ L. Fortnow and D. Whang. Optimality and domination in repeated games with bounded players. In Proceedings of the 26th ACM Symposium on the Theory of Computing, pages 741-749. ACM, New York, 1994.
  16. ^ Y. Chen, L. Fortnow, N. Lambert, D. Pennock, and J. Wortman. Complexity of combinatorial market makers. In Proceedings of the 9th ACM Conference on Electronic Commerce, pages 190-199. ACM, New York, 2008.
  17. ^ Y. Chen, S. Dimitrov, R. Sami, D. Reeves, D. Pennock, R. Hanson, L. Fortnow, and R. Gonen. Gaming prediction markets: Equilibrium strategies with a market maker. Algorithmica, 2009.

External links